Compiling Join-Patterns

Compiling Pattern Matching in Join-Patterns

Factor-Join: A Unique Approach to Compiling Array Languages for Parallel Machines

This paper describes a new approach to compiling and optimizing array languages for parallel machines. This approach rst decomposes array language operations into factors, where each factor corresponds to a diierent communication or computation structure. Optimizations are then achieved by combining, or joining, these factors. Because factors preserve high level information about array operatio...

Compiling Technique Based on Data ow Analysis for Functional Programming Language Valid

This paper presents a compiling method to translate the functional programming language Valid into object code which is executable on a commercially available shared memory multiprocessor, Sequent Symmetry S2000. Since process management overhead in such a machine is very high, our compiling strategy is to exploit coarse-grain parallelism at function application level, and the function applicat...

XQuery Join Graph Isolation

A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional XQuery language, however, yields odd algebraic plan shapes featuring scattered distributions of join operators that currently overwhelm commercial SQL query optimizers. This work rewrites such plans before submission t...

Compiling Away Set Containment and Intersection Joins

We investigate the effect of query rewriting on joins involving set-valued attributes in object-relational database management systems. We show that by unnesting set-valued attributes (that are stored in an internal nested representation) prior to the actual set containment or intersection join we can improve the performance of query evaluation by an order of magnitude. By giving example query ...